Termination w.r.t. Q of the following Term Rewriting System could not be shown:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(a, f(a, x)) → f(c, f(b, x))
f(b, f(b, x)) → f(a, f(c, x))
f(c, f(c, x)) → f(b, f(a, x))
Q is empty.
↳ QTRS
↳ DependencyPairsProof
Q restricted rewrite system:
The TRS R consists of the following rules:
f(a, f(a, x)) → f(c, f(b, x))
f(b, f(b, x)) → f(a, f(c, x))
f(c, f(c, x)) → f(b, f(a, x))
Q is empty.
Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:
F(a, f(a, x)) → F(b, x)
F(c, f(c, x)) → F(a, x)
F(a, f(a, x)) → F(c, f(b, x))
F(b, f(b, x)) → F(a, f(c, x))
F(c, f(c, x)) → F(b, f(a, x))
F(b, f(b, x)) → F(c, x)
The TRS R consists of the following rules:
f(a, f(a, x)) → f(c, f(b, x))
f(b, f(b, x)) → f(a, f(c, x))
f(c, f(c, x)) → f(b, f(a, x))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ EdgeDeletionProof
Q DP problem:
The TRS P consists of the following rules:
F(a, f(a, x)) → F(b, x)
F(c, f(c, x)) → F(a, x)
F(a, f(a, x)) → F(c, f(b, x))
F(b, f(b, x)) → F(a, f(c, x))
F(c, f(c, x)) → F(b, f(a, x))
F(b, f(b, x)) → F(c, x)
The TRS R consists of the following rules:
f(a, f(a, x)) → f(c, f(b, x))
f(b, f(b, x)) → f(a, f(c, x))
f(c, f(c, x)) → f(b, f(a, x))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We deleted some edges using various graph approximations
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ EdgeDeletionProof
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
F(a, f(a, x)) → F(b, x)
F(a, f(a, x)) → F(c, f(b, x))
F(c, f(c, x)) → F(a, x)
F(b, f(b, x)) → F(a, f(c, x))
F(b, f(b, x)) → F(c, x)
F(c, f(c, x)) → F(b, f(a, x))
The TRS R consists of the following rules:
f(a, f(a, x)) → f(c, f(b, x))
f(b, f(b, x)) → f(a, f(c, x))
f(c, f(c, x)) → f(b, f(a, x))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.